Distributionally Robust Newsvendor Problems with Variation Distance
نویسندگان
چکیده
We use distributionally robust stochastic programs (DRSP) to model a general class of newsvendor problems where the underlying demand distribution is unknown, and so the goal is to find an order quantity that minimizes the worst-case expected cost among an ambiguity set of distributions. The ambiguity set consists of those distributions that are not far—in the sense of the so-called variation distance—from a nominal distribution. The maximum distance allowed in the ambiguity set (called level of robustness) places the DRSP between the “classical” stochastic programming and robust optimization models, which correspond to setting the level of robustness to zero and infinity, respectively. The structure of the newsvendor problem allows us to analyze the problem from multiple perspectives: First, we derive explicit formulas and properties of the optimal solution as a function of the level of robustness. Moreover, we determine the regions of demand that are critical (in a precise sense) to optimal cost from the viewpoint of a risk-averse decision maker. Finally, we establish quantitative relationships between the distributionally robust model and the corresponding risk-neutral and classical robust optimization models, which include the price of optimism/pessimism, and the nominal/worstcase regrets, among others. Our analyses can help the decision maker better understand the role of demand uncertainty in the problem and can guide him/her to choose an appropriate level of robustness. We illustrate our results with numerical experiments on a variety of newsvendor problems with different characteristics. ∗[email protected] †[email protected] ‡[email protected]; Corresponding author
منابع مشابه
Tractable Distributionally Robust Optimization with Data
We present a unified and tractable framework for distributionally robust optimization that could encompass a variety of statistical information including, among others things, constraints on expectation, conditional expectation, and disjoint confidence sets with uncertain probabilities defined by φ-divergence. In particular, we also show that the Wasserstein-based ambiguity set has an equivalen...
متن کاملDistributionally robust multi-item newsvendor problems with multimodal demand distributions
We present a risk-averse multi-dimensional newsvendor model for a class of products whose demands are strongly correlated and subject to fashion trends that are not fully understood at the time when orders are placed. The demand distribution is known to be multimodal in the sense that there are spatially separated clusters of probability mass but otherwise lacks a complete description. We assum...
متن کاملLikelihood robust optimization for data-driven problems
We consider optimal decision-making problems in an uncertain environment. In particular, we consider the case in which the distribution of the input is unknown, yet there is some historical data drawn from the distribution. In this paper, we propose a new type of distributionally robust optimization model called the likelihood robust optimization (LRO) model for this class of problems. In contr...
متن کاملDistributionally robust mixed integer linear programs: Persistency models with applications
In this paper, we review recent advances in the distributional analysis of mixed integer linear programs with random objective coefficients. Suppose that the probability distribution of the objective coefficients is incompletely specified and characterized through partial moment information. Conic programming methods have been recently used to find distributionally robust bounds for the expecte...
متن کاملDistributionally robust inventory control when demand is a martingale
Demand forecasting plays an important role in many inventory control problems. To mitigate the potential harms of model misspecification in this context, various forms of distributionally robust optimization have been applied. Although many of these methodologies suffer from the problem of time-inconsistency, the work of Klabjan, Simchi-Levi and Song [83] established a general time-consistent f...
متن کامل